Discount-sensitive equilibria in zero-sum stochastic differential games
نویسندگان
چکیده
منابع مشابه
Bias and Overtaking Equilibria for Zero-Sum Stochastic Differential Games
This paper deals with zero-sum stochastic differential games with long-run average payoffs. Our main objective is to give conditions for existence and characterization of bias and overtaking optimal equilibria. To this end, first we characterize the family of optimal average payoff strategies. Then, within this family, we impose suitable conditions to determine the subfamilies of bias and overt...
متن کاملAlmost Stationary (-Equilibria in Zero-Sum Stochastic Games
We show the existence of almost stationary (-equilibria, for all (H0, in zero-sum stochastic games with finite state and action spaces. These are (-equilibria with the property that, if neither player deviates, then stationary strategies are played forever with probability almost 1. The proof is based on the construction of specific stationary strategy pairs, with corresponding rewards equal to...
متن کاملZero-Sum Games: Minimax Equilibria
Matching Pennies is a well-known example of a two player, zero-sum game. In this game, each of the players, the matcher and the mismatcher, flips a coin, and the payoffs are determined as follows. If the coins come up matching (i.e., both heads or both tails), then the matcher wins, so the mismatcher pays the matcher the sum of $1. If the coins do not match (i.e., one head and one tail), then t...
متن کاملDefinable Zero-Sum Stochastic Games
Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally subanalytic stochastic games. We prove that the Shapley operator of any definable stochastic game with separable transition and reward functions is definable in...
متن کاملComputing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear programs of roughly the same dimensions as the standard linear programs describing the Nash equilibria of the game.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Dynamics and Games
سال: 2016
ISSN: 2164-6066
DOI: 10.3934/jdg.2016002